package com.test.daily.leetcode.y2022.m06.day0608.v03;

/**
 * @descriptions:
 * @author: Tom
 * @date: 2022/6/8 下午 05:01
 * @version: 1.0
 */
public class Solution {
    public boolean isBoomerang(int[][] points) {
        return !((points[2][1] - points[1][1]) *  (points[1][0] - points[0][0]) == (points[1][1] - points[0][1])*(points[2][0] - points[1][0])) ;
    }
}
